package midalgorithms.dynamicplanning;

public class _02UniquePaths {
    public static int uniquePaths(int m, int n) {
        //  动态规划
        //  dp[i][j] = dp[i-1][j] + dp[i][j-1];
        int[][] dp = new int[m][n];
        dp[0][0] = 1;
        //  填充边界元素
        for (int i = 1;i < m;i++){
            dp[i][0] = 1;
        }
        for (int i = 1;i < n;i++){
            dp[0][i] = 1;
        }
        for (int i = 1;i < m;i++){
            for (int j = 1;j < n;j++){
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
}
